BRIEF REPORT Suppressed semantic information accelerates analytic problem solving

نویسندگان

  • Darya L. Zabelina
  • Emmanuel Guzman-Martinez
  • Laura Ortega
  • Marcia Grabowecky
  • Satoru Suzuki
  • Mark Beeman
چکیده

The present study investigated the limits of semantic processing without awareness, during continuous flash suppression (CFS). We used compound remote associate word problems, in which three seemingly unrelated words (e.g., pine, crab, sauce) form a common compound with a single solution word (e.g., apple). During the first 3 s of each trial, the three problem words or three irrelevant words (control condition) were suppressed from awareness, using CFS. The words then became visible, and participants attempted to solve the word problem. Once the participants solved the problem, they indicated whether they had solved it by insight or analytically. Overall, the compound remote associate word problems were solved significantly faster after the problem words, as compared with irrelevant words, were presented during the suppression period. However this facilitation occurred only when people solved with analysis, not with insight. These results demonstrate that semantic processing, but not necessarily semantic integration, may occur without awareness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information - Analytic System for Problem Solving of Socioeconomic Monitoring

The experience of creation and research of information analytic system is discussed. The system is oriented towards a solution of socioeconomic problems. The report describes “Monitor 2.1” system, which have been developed for The Ministry of Economy of Autonomous Republic of Crimea. The report contents the principles and approaches to the development of the next version of that system – “Monit...

متن کامل

Artificial intelligence: themes in the second decade

lems solving, and closely associated learning models. The focus in time is the period 1963-1968. Brief tours are made over a variety of topics: generality, integrated robots, game playing, theorem proving, semantic information processing, etc. One program, which employs the heuristic search paradigm to generate explanatoryhypotheses in the analysis of mass spectra of organic molecules, is descr...

متن کامل

2 Inductively Speeding Up Logic Programs

This paper presents a speed-up learning method for logic programs, which accelerates a program by composing macro clauses based on partial structures of proof trees. Many systems have been proposed for composing useful macros, e.g., some of them select macros that connects two peaks in a heuristic function. Another employs heuristics that select useful macros. Although they work well in some do...

متن کامل

A Survey on Various Ontology Matching Systems

Due to the abundant growth of the semantic web massive amount of heterogeneous data’s are growing enormously. This problem of heterogeneity among the web resources can be resolved using various ontology matching techniques and systems. Ontology matching is a great way of solving the heterogeneity and interoperability issues among the web data’s that use different but related ontologies. Ontolog...

متن کامل

Total Protection of Analytic Invariant Information in Cross Tabulated Tables

To protect sensitive information in a cross tabulated table, it is a common practice to suppress some of the cells in the table. An analytic invariant is a power series in terms of the suppressed cells that has a unique feasible value and a convergence radius equal to +∞. Intuitively, the information contained in an invariant is not protected even though the values of the suppressed cells are n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016